Greville’s method for preconditioning least squares problems
نویسندگان
چکیده
منابع مشابه
Greville's method for preconditioning least squares problems
X. Cui Department of Informatics, School of Multidisciplinary Sciences, The Graduate University for Advanced Studies (Sokendai), 2-1-2, Hitotsubashi, Chiyoda-ku, Tokyo, Japan, 101-8430 K. Hayami Principles of Informatics Research Division, National Institute of Informatics, 2-1-2, Hitotsubashi, Chiyodaku, Tokyo, Japan, 101-8430 J. Yin Department of Mathematics, Tongji University, Shanghai, P.R....
متن کاملLeast – Squares Method For Estimating Diffusion Coefficient
Abstract: Determination of the diffusion coefficient on the base of solution of a linear inverse problem of the parameter estimation using the Least-square method is presented in this research. For this propose a set of temperature measurements at a single sensor location inside the heat conducting body was considered. The corresponding direct problem was then solved by the application of the ...
متن کاملLEAST – SQUARES METHOD FOR ESTIMATING DIFFUSION COEFFICIENT
Determining the diffusion coefficient based on the solution of the linear inverse problem of the parameter estimation by using the Least-square method is presented. A set of temperature measurements at a single sensor location inside the heat conducting body is required. The corresponding direct problem will be solved by an application of the heat fundamental solution.
متن کاملLU Preconditioning for Overdetermined Sparse Least Squares Problems
We investigate how to use an LU factorization with the classical lsqr routine for solving overdetermined sparse least squares problems. Usually L is much better conditioned than A and iterating with L instead of A results in faster convergence. When a runtime test indicates that L is not sufficiently well-conditioned, a partial orthogonalization of L accelerates the convergence. Numerical exper...
متن کاملApproximate Generalized Inverse Preconditioning Methods for Least Squares Problems
iv erative methods to solve least squares problems more efficiently. We especially focused on one kind of preconditioners, in which preconditioners are the approximate generalized inverses of the coefficient matrices of the least squares problems. We proposed two different approaches for how to construct the approximate generalized inverses of the coefficient matrices: one is based on the Minim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Computational Mathematics
سال: 2011
ISSN: 1019-7168,1572-9044
DOI: 10.1007/s10444-011-9171-x